Least Totients in Arithmetic Progressions
نویسندگان
چکیده
Let N(a, m) be the least integer n (if exists) such that φ(n) ≡ a (mod m). Friedlander and Shparlinski proved that for any ε > 0 there exists A = A(ε) > 0 such that for any positive integer m which has no prime divisors p < (log m) and any integer a with gcd(a,m) = 1, we have the bound N(a,m) ¿ m. In the present paper we improve this bound to N(a,m) ¿ m.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملThe Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
How few three-term arithmetic progressions can a subset S ⊆ ZN := Z/NZ have if |S| ≥ υN? (that is, S has density at least υ). Varnavides [4] showed that this number of arithmetic-progressions is at least c(υ)N for sufficiently large integers N ; and, it is well-known that determining good lower bounds for c(υ) > 0 is at the same level of depth as Erdös’s famous conjecture about whether a subset...
متن کاملFurstenberg’s proof of long arithmetic progressions: Introduction to Roth’s Theorem
These are the notes for the first of a pair of lectures that will outline a proof given by Hillel Furstenberg [3] for the existence of long arithmetic progressions in sets of integers with positive upper density, a result first proved by Szemerédi [8]. 1 History of long arithmetic progressions The first major result in the theory of long arithmetic progressions was due to van der Waerden in 192...
متن کاملExtremal Orders of Certain Functions Associated with Regular Integers (mod n)
Let V (n) denote the number of positive regular integers (mod n) that are ≤ n, and let Vk(n) be a multidimensional generalization of the arithmetic function V (n). We find the Dirichlet series of Vk(n) and give the extremal orders of some totients involving arithmetic functions which generalize the sum-of-divisors function and the Dedekind function. We also give the extremal orders of other tot...
متن کاملEnumerating Permutations that Avoid Three Term Arithmetic Progressions
It is proved that the number of permutations of the set {1, 2, 3, . . . , n} that avoid three term arithmetic progressions is at most (2.7) n 21 for n ≥ 11 and at each end of any such permutation, at least ⌊ 2 ⌋−6 entries have the same parity.
متن کامل